Hemispherical Projection for Progressive Radiosity Calculation on Massively Parallel Architectures

نویسندگان

  • Christophe Renaud
  • François Bricout
  • Eric Leprêtre
چکیده

This paper describes a massively parallel implementation of the progressive radiosity algorithm. Our algorithm is based on an hemispherical projection approach, which provides an accurate form factor approximation. As the projection plane is mapped onto a processor mesh, we propose different techniques decreasing computation time by reducing as much as possible processor inactivity. This approach successfully handles large sets of form factor sampling elements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Massively Parallel Progressive Radiosity on the MP-1

Radiosity is a powerful method for solving the global illumination problem in the case of purely diffuse light reflexions. The progressive refinement algorithm provides interactivity during computation by displaying intermediate images, and overshooting methods increases the convergence rate of progressive radiosity. However, computation times remain very important. Parallelising these algorith...

متن کامل

Spatial Partitioning for Parallel Hierarchical Radiosity on Distributed Memory Architectures

This paper presents an efficient, highly scalable implementation of the Hierarchical Radiosity Algorithm. We present a clever mapping of Hierarchical Radiosity to high-dimensional spaces that manifests a locality property, which can greatly reduce communication on parallel distributed memory architectures. We use a very simple dynamic spatial partitioning method to keep the mapping balanced. We...

متن کامل

A Parallel Approach to Hierarchical Radiosity

A parallel algorithm solving the radiosity equation is presented. It is based on the hierarchical approach (HR) 5] and realized on a massively parallel supercomputer | the ConnectionMachine 5. Our algorithm considers the HR approach as a process that manipulates an huge graph structure. Simulated annealing is used in the graph's rearranging procedure to achieve a good work-balance and nearly op...

متن کامل

A parallel progressive radiosity algorithm based on patch data circulation

--Current research on radiosity has concentrated on increasing the accuracy and the speed of the solution. Although algorithmic and meshing techniques decrea,se the execution time, still excessive computational power is required for complex scenes. Hence, parallelism can be exploited for speeding up the method further. This paper aims at providing a thorough examination of parallelism in the ba...

متن کامل

1 An Environment - Projection Approach to Radiosity for Mesh - Connected Computers

We describe a progressive re nement radiosity algorithm for highly-parallel meshconnected SIMD or MIMD computers. The technique is based on environmentprojection and scales easily to large machines and datasets. Form-factor computations can be performed using local communication by mapping the single-plane across the processor mesh. We report on the performance of an implementation on the MasPa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993